The λ-context Calculus
نویسندگان
چکیده
منابع مشابه
The λ-context calculus
We present a simple but expressive lambda-calculus whose syntax is populated by variables which behave like meta-variables. It can express both capture-avoiding and capturing substitution (instantiation). To do this requires several innovations, including a key insight in the confluence proof and a set of reduction rules which manages the complexity of a calculus of contexts over the ‘vanilla’ ...
متن کاملThe λ-calculus in the π-calculus
Mathematical Structures in Computer Science / Volume 21 / Issue 05 / October 2011, pp 943 996 DOI: 10.1017/S0960129511000260, Published online: 19 May 2011 Link to this article: http://journals.cambridge.org/abstract_S0960129511000260 How to cite this article: XIAOJUAN CAI and YUXI FU (2011). The λ-calculus in the π-calculus. Mathematical Structures in Computer Science, 21, pp 943-996 doi:10.10...
متن کاملThe structural λ-calculus
Inspired by a recent graphical formalism for λ-calculus based on Linear Logic technology, we introduce an untyped structural λ-calculus, called λj, which combines action at a distance with exponential rules decomposing the substitution by means of weakening, contraction and dereliction. Firstly, we prove fundamental properties such as confluence and preservation of β-strong normalisation. Secon...
متن کاملThe Permutative λ-Calculus
We introduce the permutative λ-calculus, an extension of λ-calculus with three equations and one reduction rule for permuting constructors, generalising many calculi in the literature, in particular Regnier’s sigma-equivalence and Moggi’s assoc-equivalence. We prove confluence modulo the equations and preservation of beta-strong normalisation (PSN) by means of an auxiliary substitution calculus...
متن کاملThe vectorial λ-calculus
We describe a type system for the linear-algebraic λ-calculus. The type system accounts for the linear-algebraic aspects of this extension of λ-calculus: it is able to statically describe the linear combinations of terms that will be obtained when reducing the programs. This gives rise to an original type theory where types, in the same way as terms, can be superposed into linear combinations. ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Notes in Theoretical Computer Science
سال: 2008
ISSN: 1571-0661
DOI: 10.1016/j.entcs.2007.09.015